On two coloring problems in mixed graphs
نویسندگان
چکیده
منابع مشابه
Parameterized Coloring Problems on Chordal Graphs
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two parameterized versions of the problem are studied in the paper: either the number of precolored vertices or the number of colors used in the precolo...
متن کاملGeombinatorial Mixed Hypergraph Coloring Problems
Can you color Rn so that point sets of one sort are never monochromatic, while point sets of another sort always are? If so, how many colors did you use, and can you do the job with more or fewer colors?
متن کاملExtremal graphs in some coloring problems
For a simple graph G with chromatic number x(G), the Nordhaus-Gaddum inequalities give upper and lower bounds for z(G)•(G ¢) and z(G)+ x(GC). Based on a characterization by Fink of the extremal graphs G attaining the lower bounds for the product and sum, we characterize the extremal graphs G for which A(G)B(G c) is minimum, where A and B are each of chromatic number, achromatic number and pseud...
متن کاملSome Results on Edge Coloring Problems with Constraints in Graphs∗
In this paper some new results on the acyclic-edge coloring , f -edge coloring, g-edge cover coloring, (g, f )-coloring and equitable edge-coloring of graphs are introduced. In particular, some new results related to the above colorings obtained by us are given. Some new problems and conjectures are presented.
متن کاملClosing Complexity Gaps for Coloring Problems on H-Free Graphs
If a graph G contains no subgraph isomorphic to some graph H, then G is called H-free. A coloring of a graph G = (V,E) is a mapping c : V → {1, 2, . . .} such that no two adjacent vertices have the same color, i.e., c(u) 6= c(v) if uv ∈ E; if |c(V )| ≤ k then c is a k-coloring. The Coloring problem is to test whether a graph has a coloring with at most k colors for some integer k. The Precolori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.03.006